Solving Mesh Eigenproblems with Multigrid Efficiency

نویسنده

  • KLAUS NEYMEYR
چکیده

Multigrid techniques can successfully be applied to mesh eigenvalue problems for elliptic differential operators. They allow to compute a few of the smallest eigenvalues and the eigenfunctions within optimal or quasi-optimal computational complexity. A review is given on three multigrid solvers for elliptic eigenproblems. Numerical results are presented for a simple model problem.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Posteriori Error Estimation for a Preconditioned Algorithm to Solve Elliptic Eigenproblems

This paper presents an a posteriori error estimator for the preconditioned iteration scheme of Bramble, Knyazev and Pasciak to compute the smallest eigenvalues together with its invariant subspace of an elliptic diierential operator. The error estimator is applied both to the nite element space in which the preconditioned iteration is performed (iteration error estimation) as well as to its hie...

متن کامل

Multigrid Methods for Nearly Singular Linear Equations and Eigenvalue Problems

The purpose of this paper is to develop a convergence theory for multigrid methods applied to nearly singular linear elliptic partial differential equations of the type produced from a positive definite system by a shift with the identity. One of the important aspects of this theory is that it allows such shifts to vary anywhere in the multigrid scheme, enabling its application to a wider class...

متن کامل

Memory efficient adaptive mesh generation and implementation of multigrid algorithms using Sierpinski curves

We will present an approach to numerical simulation on recursively structured adaptive discretisation grids. The respective grid generation process is based on recursive bisection of triangles along marked edges. The resulting refinement tree is sequentialised according to a Sierpinski space-filling curve, which leads to both minimal memory requirements and inherently cache-efficient processing...

متن کامل

/P0 Element and Its Multigrid Method for the Incompressible Stokes Problem

We discuss a mortar-type P 1 /P0 element method for the incompressible Stokes problem. We prove the inf-sup condition and obtain the optimal error estimate. Meanwhile, we propose a W-cycle multigrid for solving this discrete problem and prove the optimal convergence of the multigrid method, that is, the convergence rate is independent of the mesh size and mesh level. Finally, numerical experime...

متن کامل

High Order Compact Difference Scheme and Multigrid Method for 2D Elliptic Problems with Variable Coefficients and Interior/Boundary Layers on Nonuniform Grids

In this paper, a high order compact difference scheme and a multigrid method are proposed for solving two-dimensional (2D) elliptic problems with variable coefficients and interior/boundary layers on nonuniform grids. Firstly, the original equation is transformed from the physical domain (with a nonuniform mesh) to the computational domain (with a uniform mesh) by using a coordinate transformat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002